Mesh Segmentation Using Laplacian Eigenvectors and Gaussian Mixtures
نویسندگان
چکیده
In this paper a new completely unsupervised mesh segmentation algorithm is proposed, which is based on the PCA interpretation of the Laplacian eigenvectors of the mesh and on parametric clustering using Gaussian mixtures. We analyse the geometric properties of these vectors and we devise a practical method that combines single-vector analysis with multiple-vector analysis. We attempt to characterize the projection of the graph onto each one of its eigenvectors based on PCA properties of the eigenvectors. We devise an unsupervised probabilistic method, based on one-dimensional Gaussian mixture modeling with model selection, to reveal the structure of each eigenvector. Based on this structure, we select a subset of eigenvectors among the set of the smallest non-null eigenvectors and we embed the mesh into the isometric space spanned by this selection of eigenvectors. The final clustering is performed via unsupervised classification based on learning a multi-dimensional Gaussian mixture model of the embedded graph.
منابع مشابه
Spectral 3D mesh segmentation with a novel single segmentation field
We present an automatic mesh segmentation framework, which achieves 3D segmentation in two stages, comprising hierarchical spectral analysis and isolinebased boundary detection. During hierarchical spectral analysis, a novel single segmentation field is defined to capture concavity-aware decompositions of eigenvectors from a concavity-aware Laplacian. Specifically, on the eigenvector hierarchy,...
متن کاملSeeded Laplaican: An Eigenfunction Solution for Scribble Based Interactive Image Segmentation
In this paper, we cast the scribble-based interactive image segmentation as a semi-supervised learning problem. Our novel approach alleviates the need to solve an expensive generalized eigenvector problem by approximating the eigenvectors using efficiently computed eigenfunctions. The smoothness operator defined on feature densities at the limit n → ∞ recovers the exact eigenvectors of the grap...
متن کاملWatermarking 3D Polygonal Meshes in the Mesh Spectral Domain
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright and to detect tampering. This paper presents a new robust watermarking method that adds watermark into a 3D polygonal mesh in the mesh’s spectral domain. The algorithm computes spectra of the mesh by using eigenvalue d...
متن کاملSpeech Enhancement using Laplacian Mixture Model under Signal Presence Uncertainty
In this paper an estimator for speech enhancement based on Laplacian Mixture Model has been proposed. The proposed method, estimates the complex DFT coefficients of clean speech from noisy speech using the MMSE estimator, when the clean speech DFT coefficients are supposed mixture of Laplacians and the DFT coefficients of noise are assumed zero-mean Gaussian distribution. Furthermore, the MMS...
متن کاملQuadrangulating a Mesh using Laplacian Eigenvectors
Resampling raw surface meshes is one of the most fundamental operations used by nearly all digital geometry processing systems. The vast majority of work in the past has focused on triangular remeshing; the equally important problem of resampling surfaces with quadrilaterals has remained largely unaddressed. Despite the relative lack of attention, the need for quality quadrangular resampling me...
متن کامل